Tree Automata, (Dis-)Equality Constraints and Term Rewriting - What's New?
نویسنده
چکیده
Connections between Tree Automata and Term Rewriting are now well known. Whereas tree automata can be viewed as a subclass of ground rewrite systems, tree automata are successfully used as decision tools in rewriting theory. Furthermore, applications, including rewriting theory, have influenced the definition of new classes of tree automata. In this talk, we will first present a short and not exhaustive reminder of some fruitful applications of tree automata in rewriting theory. Then, we will focus on extensions of tree automata, specially tree automata with local or/and global (dis-)equality constraints: we will emphasize new results, compare different extensions, and sketch some applications. This talk will be strongly inspired by recent works of several researchers, specially but not exclusively: Emmanuel Filiot, Guillem Godoy, Florent Jacquemard, Jean-Marc Talbot, Camille
منابع مشابه
22nd International Conference on Rewriting Techniques and Applications (RTA'11)
Connections between Tree Automata and Term Rewriting are now well known. Whereas treeautomata can be viewed as a subclass of ground rewrite systems, tree automata are successfullyused as decision tools in rewriting theory. Furthermore, applications, including rewriting theory,have influenced the definition of new classes of tree automata. In this talk, we will first presenta sho...
متن کاملThe Recognizability Problem for Tree Automatawith Comparisons
Several extensions of tree automata have been deened, in order to take in account non-linearity in terms. Roughly, these automata allow equality or disequality constraints between subterms. They have been used to get decision results, e.g. in term rewriting. One natural question arises when we consider a language recognized by such an automaton: is this language recognizable, i.e. are the const...
متن کاملClosure of Tree Automata Languages under Innermost Rewriting
Preservation of regularity by a term rewrite system (TRS) states that the set of reachable terms from a tree automata (TA) language (aka regular term set) is also a TA language. It is an important and useful property, and there have been many works on identifying classes of TRS ensuring it; unfortunately, regularity is not preserved for restricted classes of TRS like shallow TRS. Nevertheless, ...
متن کاملRigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a restriction on the computation of RTA on trees: two subtrees reaching the same rigid state in a run must be equal. RTA are able to perform local and global tests of equality between subtrees, non-linear tree pattern matchi...
متن کاملTree Automata with Global Constraints
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be arbitrarily faraway. In particular, it is equipped with an (dis)equality relation on states, so that whenever two subtrees t and t′ evaluate (in an accepting run) to two states which are in the (dis)equality relation...
متن کامل